Polytypic Abstraction in Type Theory
نویسنده
چکیده
This paper is concerned with formalizations and veriications in type theory that are abstracted with respect to a large class of datatypes; i.e polytypic formalizations. The main advantage of these developments are that they can not only be used to polytypically deene functions but also to formally state polytypic theorems and to interactively develop polytypic proofs using existing proof editors. Polytypic program and proof construction in a type-theoretic setting is exempliied by the deenition of a polytypic map function and by mechanized proofs of corresponding properties such as preservation of composition and fusion theorems.
منابع مشابه
Polytypic Functional Programming
Structural polymorphism is a generic programming technique known within the functional programming community under the names of polytypic or datatype-generic programming. In this thesis we show that such a technique conflicts with the principle of data abstraction and propose a solution for reconciliation. More concretely, we show that popular polytypic extensions of the functional programming ...
متن کاملType-safe run-time polytypic programming
Polytypic programming is a way of defining type-indexed operations, such as map, fold and zip, based on type information. Run-time polytypic programming allows that type information to be dynamically computed—this support is essential in modern programming languages that support separate compilation, first-class type abstraction, or polymorphic recursion. However, in previous work we defined ru...
متن کاملPolytypic Programming With Ease
A functional polytypic program is one that is parameterised by datatype. Since poly-typic functions are deened by induction on types rather than by induction on values they typically operate on a higher level of abstraction than their monotypic counterparts. However, polytypic programming is not necessarily more complicated than conventional programming. We show that a polytypic function is uni...
متن کاملA constructive type-theoretical Interpretation of the philosophical Methods of Abstraction and Instantiation
In the philosophical tradition, methodological procedures are often composed rather than simple: classical examples of such structures are the processes of analysis and synthesis and those of abstraction and instantiation. The latter couple is extremely relevant to logical knowledge also in modern formalization, representing the theoretical basis of basic notions such as singular and abstract, ...
متن کاملPolytypic Proof
This paper deals with formalizations and veriications in type theory that are abstracted with respect to a class of datatypes; i.e poly-typic constructions. The main advantage of these developments are that they can not only be used to deene functions in a generic way but also to formally state polytypic theorems and to synthesize polytypic proof objects in a formal way. This opens the door to ...
متن کامل